EXACT PROFILE VALUES OF SOME GRAPH COMPOSITIONS
نویسندگان
چکیده
منابع مشابه
Exact annihilating-ideal graph of commutative rings
The rings considered in this article are commutative rings with identity $1neq 0$. The aim of this article is to define and study the exact annihilating-ideal graph of commutative rings. We discuss the interplay between the ring-theoretic properties of a ring and graph-theoretic properties of exact annihilating-ideal graph of the ring.
متن کاملExact values for the Grundy number of some graphs
The Grundy number of a graph G is the maximum number k of colors used to color the vertices of G such that the coloring is proper and every vertex x colored with color i, 1 ≤ i ≤ k, is adjacent to (i 1) vertices colored with each color j, 1 ≤ j ≤ i 1. In this paper we give bounds for the Grundy number of some graphs and Cartesian products of graphs. In particular, we determine an exact value of...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولSome n-Color Compositions
In the classical theory of partitions, compositions were first defined by MacMahon [1] as ordered partitions. For example, there are 5 partitions and 8 compositions of 4. The partitions are 4, 31, 22, 21, 1 and the compositions are 4, 31, 13, 22, 21, 121, 12, 1. Agarwal and Andrews [2] defined an n-color partition as a partition in which a part of size n can come in n different colors. They den...
متن کاملGraph Compositions I: Basic Enumeration
The idea of graph compositions generalizes both ordinary compositions of positive integers and partitions of finite sets. In this paper we develop formulas, generating functions, and recurrence relations for composition counting functions for several families of graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2002
ISSN: 1027-5487
DOI: 10.11650/twjm/1500407404